Balance and Frustration in Signed Networks under Different Contexts

نویسنده

  • Samin Aref
چکیده

Frustration index is a key measure for analysing signed networks that has been underused due to its computational complexity. We use an optimisation-based method to analyse frustration as a global structural property of signed networks under different contexts. We provide exact numerical results on social and biological signed networks as well as networks of formal alliances and antagonisms between countries and financial portfolio networks. Molecular graphs of carbon and spin glass models are among other networks that we consider to discuss contextdependent interpretations of the frustration index. The findings unify the applications of a graph-theoretical measure in understanding signed networks. Highlights: Models involving signed networks in 6 different disciplines are analysed An optimisation model is used for a wide range of computational experiments Values of the frustration index in large graphs are computed exactly and efficiently Applications of signed network balance and frustration are unified

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An exact method for computing the frustration index in signed networks using binary programming

Computing the frustration index of a signed graph is a key to solving problems in different fields of research including social networks, physics, material science, and biology. In social networks the frustration index determines network distance from a state of structural balance. Although the definition of frustration index goes back to 1960, an exact algorithmic computation method has not ye...

متن کامل

Exploring the low-energy landscape of large-scale signed social networks.

Analogously to a spin glass, a large-scale signed social network is characterized by the presence of disorder, expressed in this context (and in the social network literature) by the concept of structural balance. If, as we have recently shown, the signed social networks currently available have a limited amount of true disorder (or frustration), it is also interesting to investigate how this f...

متن کامل

Frustration vs . Clusterability in Two - Mode Signed Networks ( Signed Bipartite Graphs )

Mrvar and Doreian recently defined a notion of bipartite clustering in bipartite signed graphs that gives a measure of imbalance of the signed graph, different from previous measures (the “frustration index” or “line index of balance”, l, and Davis’s clusterability). A biclustering of a bipartite signed graph is a pair (π1, π2) of partitions of the two color classes; the sets of the partitions ...

متن کامل

Partitioning signed networks

Signed networks appear naturally in contexts where conflict or animosity is apparent. In this book chapter we review some of the literature on signed networks, especially in the context of partitioning. Most of the work is founded in what is known as structural balance theory. We cover the basic mathematical principles of structural balance theory. The theory yields a natural formulation for pa...

متن کامل

Computing global structural balance in large-scale signed social networks.

Structural balance theory affirms that signed social networks (i.e., graphs whose signed edges represent friendly/hostile interactions among individuals) tend to be organized so as to avoid conflictual situations, corresponding to cycles of negative parity. Using an algorithm for ground-state calculation in large-scale Ising spin glasses, in this paper we compute the global level of balance of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1712.04628  شماره 

صفحات  -

تاریخ انتشار 2017